Almost k-wise independence versus k-wise independence

نویسندگان

  • Noga Alon
  • Oded Goldreich
  • Yishay Mansour
چکیده

We say that a distribution over {0, 1} is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. A natural question regarding ( , k)-wise independent distributions is how close they are to some k-wise independent distribution. We show that there exists ( , k)-wise independent distribution whose statistical distance is at least n · from any k-wise independent distribution. In addition, we show that for any ( , k)-wise independent distribution there exists some k-wise independent distribution, whose statistical distance is n · .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Derandomization Using Min-Wise Independent Permutations

Min-wise independence is a recently introduced notion of limited independence, similar in spirit to pairwise independence. The later has proven essential for the derandomization of many algorithms. Here we show that approximate min-wise independence allows similar uses, by presenting a derandomization of the RNC algorithm for approximate set cover due to S. Rajagopalan and V. Vazirani. We also ...

متن کامل

Measuring k-Wise Independence of Streaming Data under L2 Norm

Measuring independence and k-wise independence is a fundamental problem that has multiple applications and it has been the subject of intensive research during the last decade (see, among others, the recent work of Batu, Fortnow, Fischer, Kumar, Rubinfeld and White [11] and of Alon, Andoni, Kaufman, Matulef, Rubinfeld and Xie [2] ). In the streaming environment, this problem was first addressed...

متن کامل

Lecture 5: k-wise Independent Hashing and Applications

If the random variables X1, X2, · · · , Xn are independent, they are k-wise independent for any k. However, the converse is not true as shown by the following example. Also, if k1 > k2, k1-wise independence implies k2-wise independence. Example 2. Let X1, X2 be uniform independent random variables taking values in {0, 1}. Let X3 = X1 ⊕X2. It is easy to check that {X1, X2, X3} is pairwise indepe...

متن کامل

On the Impossibility of Amplifying the Independence of Random Variables

In this paper we prove improved lower and upper bounds on the size of sample spaces which are required to be independent on speciied neighborhoods. Our new constructions yield sample spaces whose size is smaller than previous constructions due to Schulmann8]. Our lower bounds generalize the known lower bounds of 1, 3, 2]. In obtaining these bounds we examine the possibilities and limitations of...

متن کامل

Exponential Space Improvement for minwise Based Algorithms

In this paper we introduce a general framework that exponentially improves the space, the degree of independence, and the time needed by min-wise based algorithms. The authors, in SODA11, [15] introduced an exponential time improvement for min-wise based algorithms by defining and constructing an almost k-min-wise independent family of hash functions. Here we develop an alternative approach tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 88  شماره 

صفحات  -

تاریخ انتشار 2002